Interference Decoding for Deterministic Channels
نویسندگان
چکیده
منابع مشابه
Universal decoding for memoryless Gaussian channels with a deterministic interference
A universal decoding procedure is proposed for memoryless Gaussian channels with deterministic interfering signals from a certain class. The universality of the proposed decoder is in the sense of W i g independent of the channel parameters and the unknown interfering signal, and at the same time attaining the same random coding e m r exponent as the optimal maximum likelihood (ML) decoder, whi...
متن کاملInterference Mitigation Using Optimal Successive Group Decoding for Interference Channels
In this study we aim to assess the optimal successive group decoder (OSGD) considering different scenarios and in a wide range of testing metrics. We investigate the OSGD in the K−user interference channel (IC) and evaluate its capability to mitigate interference. We inspect OSGD performance in terms of its (ergodic and effective) capacity. Also, we evaluate its minimum required energy per bit,...
متن کاملOn Achievable Rates for Non-Linear Deterministic Interference Channels
This paper extends the literature on interference alignment to more general classes of deterministic channels which incorporate non-linear input-output relationships. It is found that the concept of alignment extends naturally to these deterministic interference channels, and in many cases, the achieved degrees of freedom (DoF) can be shown to be optimal.
متن کاملUniversal Decoding for Noisy Channels
A universal decoder for a parametric family of channels is a decoder that for any channel in the family attains the same random coding error exponent as the best decoder for that particular channel. The existence and structure of such decoders is demonstrated under relatively mild conditions of continuity of the channel law with respect to the parameter indexing the family. It is further shown ...
متن کاملRobust decoding for timing channels
To transmit information by timing arrivals to a singleserver queue, we consider using the exponential server channel’s maximum-likelihood decoder. For any server with service times that are stationary and ergodic with mean 1 seconds, we show that the rate 1 nats per second (capacity of the exponential server timing channel) is achievable using this decoder. We show that a similar result holds f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2011
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2011.2119890